package binarySearch;

public class findMin {
    public int findMin(int[] nums) {
        int left=0;
        int right=nums.length-1;
        int x=nums[right];
        while(left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]>x) left=mid+1;
            else right=mid;
        }
        return nums[left];
    }
}
